Robust explicit MPC design under finite precision arithmetic
نویسندگان
چکیده
منابع مشابه
Robust explicit MPC design under finite precision arithmetic
We propose a design methodology for explicit Model Predictive Control (MPC) that guarantees hard constraint satisfaction in the presence of finite precision arithmetic errors. The implementation of complex digital control techniques, like MPC, is becoming increasingly adopted in embedded systems, where reduced precision computation techniques are embraced to achieve fast execution and low power...
متن کاملRobust MPC of constrained nonlinear systems based on interval arithmetic
A robust MPC for constrained discrete-time nonlinear systems with additive uncertainties is presented. The proposed controller is based on the concept of reachable sets, that is, the sets that contain the predicted evolution of the uncertain system for all possible uncertainties. If processes are nonlinear these sets are very difficult to compute. A conservative approximation based on interval ...
متن کاملIs Finite Precision Arithmetic Useful For Physics?
Both empirical sciences and computations are fundamentally restricted to measurements/computations involving a nite amount of information. These activities deal with the FINITE { some nite precision numbers, coming out from measurements, or from calculations run for some nite amount of time. By way of contrast, as Leibniz expressed it, mathematics is the science of the INFINITE, which contains ...
متن کاملMatrix Powers in Finite Precision Arithmetic
If A is a square matrix with spectral radius less than 1 then A k 0 as k c, but the powers computed in finite precision arithmetic may or may not converge. We derive a sufficient condition for fl(Ak) 0 as k x) and a bound on [[fl(Ak)[[, both expressed in terms of the Jordan canonical form of A. Examples show that the results can be sharp. We show that the sufficient condition can be rephrased i...
متن کاملArbitrary precision real arithmetic: design and algorithms
We describe here a representation of computable real numbers and a set of algorithms for the elementary functions associated to this representation. A real number is represented as a sequence of nite B-adic numbers and for each classical function (rational, algebraic or transcendental), we describe how to produce a sequence representing the result of the application of this function to its argu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2014
ISSN: 1474-6670
DOI: 10.3182/20140824-6-za-1003.01033